On the Euclidean TSP with a permuted Van der Veen matrix
نویسندگان
چکیده
We discuss the problem of recognizing permuted Van der Veen (VdV) matrices. It is well known that the TSP with a VdV matrix as distance matrix is pyramidally solvable. In this note we solve the problem of recognizing permuted strong VdV matrices. This yields an O(n4) time algorithm for the TSP with a permuted Euclidean VdV matrix. The problem, however, of recognizing permuted VdV matrices in general remains open. 2004 Elsevier B.V. All rights reserved.
منابع مشابه
Statistical performance analysis of the algebraic constant modulus algorithm
This paper presents a large sample analysis of the covariance of the beamformers computed by the analytical constant modulus algorithm (ACMA) method for blindly separating constant modulus sources. This can be used to predict the signal-to-interference plus noise ratio (SINR) performance of these beamformers, as well as their deviation from the (nonblind) Wiener receivers to which they asymptot...
متن کاملA comparison of lower bounds for the symmetric circulant traveling salesman problem
When the matrix of distances between cities is symmetric and circulant, the traveling salesman problem (TSP) reduces to the so-called symmetric circulant traveling salesman problem (SCTSP), that has applications in the design of reconfigurable networks, and in minimizing wallpaper waste. The complexity of the SCTSP is open, but conjectured to be NP-hard, and we compare different lower bounds on...
متن کاملDetermination of the Second Virial Coefficient for Binary Mixtures of Ar with CH4 and CO using Van der Waals and Dieterici Models
In this paper, we calculate the second virial coefficient for binary mixtures of Ar with CH4 and CO in order to evaluate the performance of equations of state (EOSs). The investigated EOSs are van der Waals (vdW), Redlich-Kwong (RK), Peng-Robinson (PR), Carnahan-Starling–van der Waals (CS-vdW) and Guggenheim-van der Waals (G-vdW) based on van der Waals model. In our work, we also use Dieterici ...
متن کاملBlind decorrelating RAKE receivers for long-code WCDMA
The problem of blind and semiblind channel estimation and symbol detection is considered for long-code wideband code division multiple access (CDMA) systems, including systems with multirate and multicode transmissions. A decorrelating matched filter, implemented efficiently in state-space, eliminates multiaccess interference and produces a bank of vector processes. Each vector process spans a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 91 شماره
صفحات -
تاریخ انتشار 2004